class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0, right = nums.size() - 1;
        while (left < right)
        {
            int mid = (right - left) / 2 + left;
            if (nums[mid] > nums.back())
                left = mid + 1;
            else
                right = mid;
        }

        return nums[right];
    }
};